On Some Communication Schemes for Distributed Pursuit–Evasion Games
نویسندگان
چکیده
A probabilistic pursuit–evasion game from the literature is used as an example to study constrained communication in multi-robot systems. Communication protocols based on time-triggered and event-triggered synchronization schemes are considered. It is shown that by limiting the communication to events when the probabilistic map updated by the individual pursuer contains new information, as measured through a map entropy, the utilization of the communication link can be considerably improved compared to conventional time-triggered communication.
منابع مشابه
Probabilistic pursuit-evasion games: theory, implementation, and experimental evaluation
We consider the problem of having a team of Unmanned Aerial Vehicles (UAV) and Unmanned Ground Vehicles (UGV) pursue a second team of evaders while concurrently building a map in an unknown environment. We cast the problem in a probabilistic game theoretic framework and consider two computationally feasible greedy pursuit policies: local-max and global-max. To implement this scenario on real UA...
متن کاملFormation Control in Multi-player Pursuit Evasion Game with Superior Evaders
In this paper, we consider a multi-pursuer multi-evader pursuit evasion game where some evaders’ maximal speeds are higher than those of all pursuers. In multi-player pursuit evasion game, hierarchical framework is applied widely in order to decompose the original complicated multi-player game into multiple small scale games, i.e. one-pursuer one-evader games and multi-pursuer single-evader gam...
متن کاملA Decentralized Fuzzy Learning Algorithm for Pursuit-Evasion Differential Games with Superior Evaders
In this paper, we consider a multi-pursuer single-superior-evader pursuit-evasion game where the evader has a speed that is similar to or higher than the speed of each pursuer. A new fuzzy reinforcement learning algorithm is proposed in this work. The proposed algorithm uses the well-known Apollonius circle mechanism to define the capture region of the learning pursuer based on its location and...
متن کاملA Dijkstra-Type Algorithm for Dynamic Games
We study zero-sum dynamic games with deterministic transitions and alternating moves of the players. Player 1 aims at reaching a terminal set and minimising a running and final cost. We propose and analyse an algorithm that computes the value function of these games extending Dijkstra’s algorithm for shortest paths on graphs. We also show the connection of these games with numerical schemes for...
متن کاملDistributed Networked Sensing and Control Systems: Robust Estimation and Real-time Control
Distributed Networked Sensing and Control Systems: Robust Estimation and Real-time Control by Songhwai Oh Doctor of Philosophy in Engineering-Electrical Engineering and Computer Sciences University of California, Berkeley Professor Shankar Sastry, Chair There is a growing interest in distributed networked sensing and control systems, such as wireless sensor networks, networked control systems, ...
متن کامل